Secret Sharing using Image Hashing
نویسنده
چکیده
This paper presents a cryptographic technique that encrypts secret information using a coding image by transforming the pixels of this image from the intensity domain to the characters domain using a hash function. In the proposed technique, the coding image will be used to encrypt the secret information at the sender and decrypt it at the receiver using the pixels whose intensity values are transformed to characters. A matrix of characters corresponding to the coding image is generated where each character in this matrix corresponds to a pixel in the coding image and each character in the secret information is mapped to a character in the matrix of characters. The locations of characters in the matrix of characters that correspond to pixels in the coding image and correspond to characters in the secret information forms the pixels map. The pixels map is encrypted using a secret key before being sent to the receiver on a secure communication channel different from that used to send the coding image and at different times. Upon receiving the coding image and the encrypted pixels map the receiver uses the secret key to decrypt the pixels map and uses the coding image and the hash function to generate the matrix of characters. Each location in the pixels map is used to retrieve a character from the matrix of characters in order to decrypt the secret information. Experimental results showed the effectiveness and the efficiency of the proposed algorithm where a message was encrypted using a coding image without modifying its pixels and it was decrypted without errors.
منابع مشابه
Image authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملCompressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملColor PNG Image Authentication Scheme Based on Rehashing and Secret Sharing Method
An authentication scheme that uses rehashing and secret sharing methods to verify the reality of a color image’s content is proposed in this paper. First, the proposed scheme uses Shamir’s secret sharing method to share image features. Second, the proposed scheme innovatively utilizes the rehashing method to overcome easy collisions of the random numbers to enhance the effectiveness against att...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کامل